ABKS-PBM: Attribute-Based Keyword Search With Partial Bilinear Map

نویسندگان

چکیده

The way services offered by cloud computing gets its unprecedented and undisputed popularity, so security concerns. Among them the storage as service model (SaaS) is of forefront these SaaS liberates individuals enterprises from management IT infrastructure data centers to concentrate on their core business. Because untrusted out-of-premise architecture users are reluctant outsource personal important data. Encryption before outsourcing addresses some issues but at same time strips useful operation such sharing searching. Now address this issue, combination keyword based searchable encryption (KSE) attribute-based (ABE) leads an searching (ABKS). resultant combined concept capable fine-grained search in multi-owner/multi-user (M/M) setting. However, underlying costly pairing complex secret mechanism ABE makes it unsuitable practical application for resource-limited devices. On top it, most existing ABKS schemes size key associated linearly expands number attributes. This paper aims presenting a novel scheme with pairing-free access verification constant AND gate structure ciphertext-policy (CP) framework. proposed work reduced standard Decisional Diffie-Hellmen (DDH) assumption, also collision free error tolerant. Finally, performance evaluation experimental results shows that improved overall efficiency communication overhead.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attribute-Based Proxy Re-Encryption with Keyword Search

Keyword search on encrypted data allows one to issue the search token and conduct search operations on encrypted data while still preserving keyword privacy. In the present paper, we consider the keyword search problem further and introduce a novel notion called attribute-based proxy re-encryption with keyword search (ABRKS), which introduces a promising feature: In addition to supporting keywo...

متن کامل

Attribute-Based Signatures for Circuits from Bilinear Map

In attribute-based signatures, each signer receives a signing key from the authority, which is associated with the signer’s attribute, and using the signing key, the signer can issue a signature on any message under a predicate, if his attribute satisfies the predicate. One of the ultimate goals in this area is to support a wide class of predicates, such as the class of arbitrary circuits, with...

متن کامل

Personalized Keyword Search with Partial-Order Preferences

Personalized search engines must be able to cope with various user preferences, retrieving the best matches to a query. For SQL and XML applications new methods for such preference-based searches have been implemented recently. Here we adopt this approach to keyword search in full-text search engines. We propose to augment the vector space model (VSM) by preference constructors having an intuit...

متن کامل

A Generic Construction for Verifiable Attribute-based Keyword Search Schemes

Cloud data owners encrypt their documents before outsourcing to provide their privacy. They could determine a search control policy and delegate the ability of search token generation to the users whose attributes satisfy the search control policy. Verifiable attribute-based keyword search (VABKS) where the users can also verify the accuracy of cloud functionality is one of such schemes. In thi...

متن کامل

Ciphertext-Policy Attribute-based Keyword Search with Revocation in Cloud through LSSS Approach

In the cloud computing, attribute-based encryption and public key encryption with keyword search are two popular issues. Ciphertext-policy attribute-based encryption is famous for its fine-grained access control. Keyword Search over encrypted files is an important function in the actual situation. We particularly concern the problem of revocation. Additionally, several solutions of the dynamic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3068194